منابع مشابه
Index of Talk Titles
Kreweras’ conjecture [1] asserts that any perfect matching of the hypercubeQd, d ≥ 2, can be extended to a Hamiltonian cycle. We proved this conjec-ture in [2] but here we present an idea of a simplified proof. The matchinggraph M(G) of a graph G is a graph whose vertex set consists of all per-fect matchings of G, with two vertices being adjacent whenever the unionof the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environmental Conservation
سال: 1986
ISSN: 0376-8929,1469-4387
DOI: 10.1017/s0376892900036225